Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
نویسندگان
چکیده
We show how contextual hyperedge replacement grammars can be used to generate abstract meaning representations (AMRs), and argue that they are more suitable for this purpose than hyperedge replacement grammars. Contextual hyperedge replacement turns out to have two advantages over plain hyperedge replacement: it can completely cover the language of all AMRs over a given domain of concepts, and at the same time its grammars become both smaller and simpler.
منابع مشابه
Contextual Hyperedge Replacement Grammars for the Generation of Abstract Meaning Representations
We attempt to describe the properties of semantic data in the form of graphs by using a graph grammar. In particular, we construct a contextual hyperedge replacement grammar (CHRG) that can generate structurally correct abstract meaning representations (AMRs) over a limited domain of semantic concepts and relations. Moreover, the CHRG can generate minimal AMRs in the sense that none of the piec...
متن کاملSeveral Aspects of Context Freeness for Hyperedge Replacement Grammars
In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...
متن کاملSecond-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting s...
متن کاملContextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...
متن کاملHyperedge Replacement Languages and Pushdown Automata
In this paper we are studying the relations between generated and accepted hyperedge replacement languages. In context freeness of hyperedge replacement grammars we can transform each grammar into an equivalent one in Greibach Normal Form (HRGNF). In order to create a pushdown automata for hyperedge replacement languages (PDAH) we build an algorithm to transform the planar structure of a hyperg...
متن کامل